The solution of some persistent p : - q resonant center problems
نویسندگان
چکیده
منابع مشابه
The p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملSPATIAL p-q RESONANT ORBITS OF THE RTBP
The purpose of this paper is to extend the study of the so called p-q resonant orbits of the planar restricted three-body problem to the spatial case. The p-q resonant orbits are solutions of the restricted three-body problem which have consecutive close encounters with the smaller primary. If E, M and P denote the larger primary, the smaller one and the infinitesimal body, respectively, then p...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولSolving some persistent presupposition problems
/S0aanes 1979/provides some counterexamples to the theory of natural language presuppositions that is presented in /Gazdar 1979/. /Soames 1982/ provides a theory which explains these eounterexamples. /Mercer 1987/ rejects the solution found in/Soames 1982/ leaving these eounterexamples unexplained. By reappraising these insightful counterexamples, the inferential theory for natural language pre...
متن کاملNew Relaxation-based Optimal Algorithms for the Solution of the Continuous and Discrete P -center Problems
The p-center problem (see, for example, [13]), also known as the minimax locationallocation problem, deals with the optimal location of emergency facilities. The locations of n demand points are given, and we need to locate p service facilities. The value of a candidate solution to the p-center problem is the maximum distance between a demand point to its nearest service facility. Our objective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Qualitative Theory of Differential Equations
سال: 2018
ISSN: 1417-3875
DOI: 10.14232/ejqtde.2018.1.99